On finite automata with a time-variant structure
نویسندگان
چکیده
منابع مشابه
A new view on fuzzy automata normed linear structure spaces
In this paper, the concept of fuzzy automata normed linear structure spaces is introduced and suitable examples are provided. ;The ;concepts of fuzzy automata $alpha$-open sphere, fuzzy automata $mathscr{N}$-locally compact spaces, fuzzy automata $mathscr{N}$-Hausdorff spaces are also discussed. Some properties related with to fuzzy automata normed linear structure spaces and fuzzy automata $ma...
متن کاملA variant of Hofstadter's sequence and finite automata
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter’s Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
متن کاملvariable structure finite time guidance law with autopilot lag
in this paper, the problem of finite time stabilization for guidance system is investigated and a novel nonlinear guidance law against maneuvering targets is proposed based on the principles of parallel navigation. the proposed law is developed using two variable structure control techniques. by applying finite time integral sliding mode and combining it with terminal sliding mode, a new guidan...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملProblems on Finite Automata and the Exponential Time Hypothesis
We study several classical decision problems on finite automata under the (Strong) Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection. All these problems are known to be CoNP-hard for nondeterministic finite automata, even when restricted to unary input alphabets. A different type of problems on finite automata relates to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1968
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(68)90706-7